|
In number theory, Maier's theorem is a theorem about the numbers of primes in short intervals for which Cramér's probabilistic model of primes gives the wrong answer. The theorem states that if π is the prime counting function and λ is greater than 1 then :, fixed). It also uses an equivalent of the number of primes in arithmetic progressions of sufficient length due to Gallagher. gave another proof, and also showed that most probabilistic models of primes incorrectly predict the mean square error : of one version of the prime number theorem. ==References== * * * 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Maier's theorem」の詳細全文を読む スポンサード リンク
|